quasiconvexoptimizationproblem

aquasiconvexoptimizationproblem;canbesolvedbybisectionexample:VonNeumannmodelofagrowingeconomymaximize(overx,x.+.)mini=1,...,nx.+i.,由AAgrawal著作·2020·被引用42次—Disciplinedquasiconvexprogramminggeneralizesdisciplinedconvexprogramming,theclassofoptimizationproblemstargetedbymostmodern.,由AVASANT著作·1986·被引用19次—Givenaboundedrealfunctionfdefinedonaclosedboundedrealinterval/,theproblemistof...

參考資訊如下
4. Convex optimization problems

a quasiconvex optimization problem; can be solved by bisection example: Von Neumann model of a growing economy maximize (over x, x. +. ) mini=1,...,n x. + i.

Disciplined quasiconvex programming

由 A Agrawal 著作 · 2020 · 被引用 42 次 — Disciplined quasiconvex programming generalizes disciplined convex programming, the class of optimization problems targeted by most modern.

Quasi

由 A VASANT 著作 · 1986 · 被引用 19 次 — Given a bounded real function f defined on a closed bounded real interval/, the problem is to find a quasi-convex function f' so as to minimize the supremum ...

Quasi-convex optimization

Quasiconvex function

In nonlinear optimization, quasiconvex programming studies iterative methods that converge to a minimum (if one exists) for quasiconvex functions. Quasiconvex ...

Quasiconvex optimization problems and asymptotic ...

由 A Iusem 著作 · 2020 · 被引用 6 次 — The main goal of this paper is to established necessary and sufficient optimality conditions for noncoercive quasiconvex optimization problems in Banach spaces.

Unique solution in a quasi

2021年3月4日 — 1 Answer 1 ... First, the problem may not have a global minimum. Think about the simple case of minx3s.t.x3≤0. Second, suppose the problem has a ...